3-variable Jensen ρ -functional inequalities and equations
نویسندگان
چکیده
منابع مشابه
Additive ρ-functional inequalities
In this paper, we solve the additive ρ-functional inequalities ‖f(x+ y)− f(x)− f(y)‖ ≤ ∥∥∥∥ρ(2f (x+ y 2 ) − f(x)− f(y) )∥∥∥∥ , (1) ∥∥∥∥2f (x+ y 2 ) − f(x)− f(y) ∥∥∥∥ ≤ ‖ρ (f(x+ y)− f(x)− f(y))‖ , (2) where ρ is a fixed non-Archimedean number with |ρ| < 1 or ρ is a fixed complex number with |ρ| < 1. Using the direct method, we prove the Hyers-Ulam stability of the additive ρ-functional inequalit...
متن کاملNormalized Jensen Functional, Superquadracity and Related Inequalities
In this paper we generalize the inequality MJn (f,x,q) ≥ Jn (f,x,p) ≥ mJn (f,x,q) where Jn (f,x,p) = n ∑ i=1 pif (xi)− f ( n ∑ i=1 pixi ) , obtained by S.S. Dragomir for convex functions. We provide cases where we can improve the bounds m and M for convex functions, and also, we show that for the class of superquadratic functions nonzero lower bounds of Jn (f,x,p)− mJn (f,x,q) and nonzero upper...
متن کاملAsymptotic behavior of alternative Jensen and Jensen type functional equations
In 1941 D.H. Hyers solved the well-known Ulam stability problem for linear mappings. In 1951 D.G. Bourgin was the second author to treat the Ulam problem for additive mappings. In 1982–2005 we established the Hyers–Ulam stability for the Ulam problem of linear and nonlinear mappings. In 1998 S.-M. Jung and in 2002–2005 the authors of this paper investigated the Hyers–Ulam stability of additive ...
متن کاملStability of Functional Inequalities with Cauchy-Jensen Additive Mappings
In 1940, Ulam [1] gave a talk before the Mathematics Club of the University of Wisconsin in which he discussed a number of unsolved problems. Among these was the following question concerning the stability of homomorphisms. We are given a group G and a metric group G′ with metric ρ(·,·). Given > 0, does there exist a δ > 0 such that if f :G→G′ satisfies ρ( f (xy), f (x) f (y)) < δ for all x, y ...
متن کاملInteger Programming with 2-Variable Equations and 1-Variable Inequalities
We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objective function. Our algorithm has worst-case running time in O(N) where N is the number of bits in the input.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nonlinear Sciences and Applications
سال: 2016
ISSN: 2008-1901
DOI: 10.22436/jnsa.009.12.07